Improved Bounds for a Class of 0-1 Integer Programs Using Combined Surrogate-lagrangean Techniques
نویسندگان
چکیده
A new method Is described for calculating bounds for a special class of 0-1 Integer programning problems. This met lod includes features of both Lagrangean and surrogate relaxation approaches. Certain binary knapsack calculations carried out in appropriate combinations together with an additivity principle provide the basis for computing the bounds.
منابع مشابه
Lagrangean/surrogate relaxation for generalized assignment problems
This work presents Lagrangean/surrogate relaxation to the problem of maximum pro®t assignment of n tasks to m agents (n > m), such that each task is assigned to only one agent subject to capacity constraints on the agents. The Lagrangean/surrogate relaxation combines usual Lagrangean and surrogate relaxations relaxing ®rst a set of constraints in the surrogate way. Then, the Lagrangean relaxati...
متن کاملUsing Local Surrogate Information in Lagrangean Relaxation: an Application to Symmetric Traveling Salesman Problems
The Traveling Salesman Problem (TSP) is a classical Combinatorial Optimization problem intensively studied. The Lagrangean relaxation was first applied to the TSP in 1970. The Lagrangean relaxation limit approximates what is known today as HK (Held and Karp) bound, a very good bound (less than 1% from optimal) for a large class of symmetric instances. It became a reference bound for new heurist...
متن کاملUsing logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
The Traveling Salesman Problem (TSP) is a classical Combinatorial Optimization problem, which has been intensively studied. The Lagrangean relaxation was first applied to the TSP in 1970. The Lagrangean relaxation limit approximates what is known today as HK (Held and Karp) bound, a very good bound (less than 1% from optimal) for a large class of symmetric instances. It became a reference bound...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملLagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems
The cellular network design (CND) problem is formulated as a comprehensive linear mixed integer programming model integrating the base station location (BSL) problem, the frequency channel assignment (FCA) problem and the topological network design (TND) problem. A solution algorithm based on Lagrangean relaxation is proposed for solving this complex cellular network design problem. Pursuing th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015